Search results for "Geographic routing"
showing 10 items of 10 documents
Lifespan-Aware Routing for Wireless Sensor Networks
2010
Wireless Sensor Networks (WSNs) have the capability to become the eyes and ears for the future networked society allowing monitoring of any habitat or object's properties remotely and independently of an energy source. Services based on this technology may change the way we monitor and control remote areas and objects. In this paper we propose a different approach to routing data across Wireless Sensor Networks. We argue that a distance-vector protocol using a lifespan-aware metric is a plausible solution to the task of routing information in WSN in a manner that both saves energy of the individual node and manages summarized energy of the system equally and fairly. The concept is designed …
A Branch-and-Cut method for the Capacitated Location-Routing Problem
2011
International audience; Recent researches in the design of logistic networks have shown that the overall distribution cost may be excessive if routing decisions are ignored when locating depots. The Location-Routing Problem (LRP) overcomes this drawback by simultaneously tackling location and routing decisions. The aim of this paper is to propose an exact approach based on a Branch-and-Cut algorithm for solving the LRP with capacity constraints on depots and vehicles. The proposed method is based on a zero-one linear model strengthened by new families of valid inequalities. The computational evaluation on three sets of instances (34 instances in total), with 5–10 potential depots and 20–88 …
A Note on the Local Minimum Problem in Wireless Sensor Networks
2013
The Local Minimum Problem occurs in geographic routing scenarios. In this paper two solutions to this problem for certain network topologies are proposed. By using the notion of virtual coordinates a theoretical and a practical constructions are presented. A distributed algorithm for the practical approach is proposed.
Power-constrained sensor selection and routing for cooperative detection in cognitive radios
2012
Given a spectrum-sensing network, a set of active nodes jointly aggregate sensed data at a preset frequency-band and simultaneously route this information to an arbitrarily chosen querying node through a power-constrained multi-hop path. Locally, each sensor node is assumed to be an energy-based detector. This work focuses on deriving algorithms that jointly optimize sensor selection and cooperative detection from which a power-efficient route to the querying node can be established, and then, a tree routing structure spanning the chosen nodes is constructed under a power budget constraint. Sensor information is sequentially aggregated along this optimized routing structure up to the queryi…
Distance Constrained Mapping to Support NoC Platforms Based on Source Routing
2010
Efficient NoC is crucial for communication among processing elements in a highly parallel processing systems on chip. Mapping cores to slots in a NoC platform and designing efficient routing algorithms are two key problems in NoC design. Source routing offers major advantages over distributed routing especially for regular topology NoC platforms. But it suffers from a serious drawback of overhead since it requires whole communication path to be stored in every packet header. In this paper, we present a core mapping technique which helps to achieve a mapping with the constraint over the path length. We have found that the path length constraint of just 50% is sufficient in most cases. We als…
Accurate reliability and availability models for direct interconnection networks
2001
Fault tolerance in multicomputer interconnection networks has been traditionally studied by determining the worst possible combination of faulty components that causes its failure and then assuming that this will occur. But, the probability of the worst possible combination is usually low, and the routing algorithm may be able to find a route between source and destination nodes. The network dependability parameters computed according to this approach will be underestimated. In this paper we propose a methodology for accurately evaluating interconnection network dependability. In addition, we apply it to obtain an accurate estimation of the reliability and availability parameters in a 2-D m…
A secure intersection-based routing protocol for data collection in urban vehicular networks
2014
Data routing has gained great intention since the appearance of Vehicular Networks (VANETs). However, in the presence of attackers, reliable and trustworthy operations in such networks become impossible without securing routing protocols. In this paper, we target to study and design a secure routing protocol S-GyTAR for vehicular environments. Several kinds of routing techniques are proposed in the literature and could be classified into topology-based or position-based strategies. Position-based is the most investigated strategy in vehicular networks due to the unique characteristics of such networks. For this reason, this work is based on the well-known intersection-based routing protocol…
A Group-Based Architecture for Wireless Sensor Networks
2007
Many routing protocols for ad-hoc networks and sensor networks have been designed, but none of them are based on groups. We propose to divide the network into several groups of sensors. When a sensor send data to other groups, the data has to arrive just to one sensor from each group, then they propagate it to the rest of sensors in their groups. We have simulated our proposal for different types of sensor topologies to know which type of topology is the best depending on the number of sensors in the whole network or depending on the number of interior sensors. We have also simulated how much time is needed to propagate information between groups. The application areas for our proposal coul…
Robust Data Gathering for Wireless Sensor Networks
2006
2005 13th IEEE International Conference on Networks jointly held with the 2005 7th IEEE Malaysia International Conference on Communications, Proceedings Volume 1, 2005, Article number 1635527, Pages 469-474 2005 13th IEEE International Conference on Networks jointly held with the 2005 7th IEEE Malaysia International Conference on Communications; Kuala Lumpur; Malaysia; 16 November 2005 through 18 November 2005; Category number05EX1235; Code 69262 Robust data gathering for wireless sensor networks (Conference Paper) Ortolani, M. , Gatani, L. , Lo Re, G. Dipartimento di Ingegneria Informatica, Università degli Studi di Palermo, Viale delle Scienze Parco d'Orleans, 90128 Palermo, Italy View re…
A service-oriented routing scheme with load balancing in wireless mesh networks
2008
Wireless mesh networks will play an important role in the next-generation wireless communication systems as it can provide wide coverage and scalable broadband Internet access services. However, congestion in such networks may lead to throughput degradation, packet loss and longer transmission delay. Therefore, routing and traffic forwarding schemes which are aware of the congestion status of a wireless network can efficiently improve network performance. In this paper, we propose a new congestion-aware routing scheme which may direct different paths for different services types, according to network congestion status. The goal of this routing scheme is to use traffic load metric for choosi…